منابع مشابه
Boundedness on Stochastic Petri Nets
Stochastic Petri nets generalize the notion of queueing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets. A.M.S. Classification : 60 G 40, 68 M 20, 60 K 25 Research partially supported by project PA86-0028 of the Spanish Comisión Interministe...
متن کاملOn Compositionality of Boundedness and Liveness for Nested Petri Nets
Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...
متن کاملFluid Stochastic Petri Nets :
In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold uid rather than discrete tokens. We deene a class of uid stochastic Petri nets in such a way that the discrete and continuous portions may aaect each other. Following this deenition we provide equations for their transient and steady-state behavior. We present several examples showing the utilit...
متن کاملStochastic Petri Nets
Any developer of discrete event systems knows that the most important quality of the final system is that it be functionally correct by exhibiting certain functional, or qualitative properties decided upon as being important. Once assured that the system behaves correctly, it is also important that it is efficient in that its running cost is minimal or that it executes in optimum time or whatev...
متن کاملRegular stochastic Petri nets
An extension of regular nets, a class of coloredd nets, to a stochastic model is proposed. We show that the symmetries in this class of nets make it pos sible to developp a performance evaluation by constructingg only a graph of symbolic markings, which ver tices are classes of states, insteadd of the whole reachability graph. Usingg algebraic techniques, we prove that all the states in a class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Complutense
سال: 1993
ISSN: 1988-2807,1139-1138
DOI: 10.5209/rev_rema.1993.v6.n1.17857